Trivial Measures are not so Trivial

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving inductive reasoning problems in mathematics: not-so-trivial pursuit

This study investigated the cognitive processes involved in inductive reasoning. Sixteen undergraduates solved quadratic function–finding problems and provided concurrent verbal protocols. Three fundamental areas of inductive activity were identified: Data Gathering, Pattern Finding, and Hypothesis Generation. These activities are evident in three different strategies that they used to successf...

متن کامل

The (not so) Trivial Lifting in Two Dimensions

When generating cutting-planes for mixed-integer programs from multiple rows of the simplex tableau, the usual approach has been to relax the integrality of the non-basic variables, compute an intersection cut, then strengthen the cut coefficients corresponding to integral non-basic variables using the so-called trivial lifting procedure. Although of polynomialtime complexity in theory, this li...

متن کامل

On Trivial Gradient Young Measures

We give a condition on a closed set K of real n mma trices which ensures that any W p gradient Young measure sup ported on K must be trivial the condition given is also necessary when K is bounded Introduction Assume is a smooth bounded domain in R and p is a given number Let W p R be the usual Sobolev space of maps u from to R the Jacobi or gradient matrix ru of u is L integrable and thus de n...

متن کامل

How Trivial Is Trivial

This question is, I feel, in the same kind of idiot category as how long is a piece of string? interviewed recently by a journalist planning to write an article about the women (like me) who conduct 'Auntie' columns in women's magazines, I was asked what proportion of the letters I received each week could be labelled trivial. Her eyebrows shot up when I said that in my view, no human problem w...

متن کامل

Elections Are Conceptually Trivial

After everyone has voted, the votes in each ballot position are counted, and the winner of each race is declared. Barring the use of some form of ranked-preference ballot, the algorithms required are hardly more than mere summations. What makes elections difficult is the problem of performing this summation over a canvassing hierarchy spanning many polling places and local election offices, whe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theory of Computing Systems

سال: 2015

ISSN: 1432-4350,1433-0490

DOI: 10.1007/s00224-015-9614-8